LOGICAL CLASSIFICATION TREES IN RECOGNITION PROBLEMS

Bagging Model Trees for Classification Problems

Structurally, a model tree is a regression method that takes the form of a decision tree with linear regression functions instead of terminal class values at its leaves. In this study, model trees are coupled with bagging for solving classification problems. In order to apply this regression technique to classification problems, we consider the conditional class probability function and seek a ...

Binary Classification Trees for Multi-class Classification Problems

This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class group is partitioned into two distinct subgroups at a node. The node adopts the class-modular scheme to improve the binary classification capability. The partitioning is formulated as an optimization problem and a gene...

Logical Trees in Risk Analysis

Problems in Logical Form

(P Xl ... X.) <-> (SOME E (EVENT E) ((gVABS F) E xl . . . xn)) In simple cases we can use the more straightforward f o r m . The l o g i c a l f o r m o f " J o h n i s k i s s i n g Mary" w o u l d s i m p l y be (KISS JOHN MARY). The l o g i c a l f o r m o f " J o h n i s g e n t l y k i s s i n g M a r y , " h o w e v e r , w o u l d be (SOME Z (EVENT E) (AND ((EWSS KZSS) Z JoHN ~ Y ) (GENT...

Combining Classification and Model Trees for Handling Ordinal Problems

Given an ordered class, one is not only interested in minimizing the classification error, but also in minimizing the distances between the actual and the predicted class. This study offers an organized study on the various methodologies that have tried to handle this problem and presents an experimental study of these methodologies with a proposed voting technique, which combine the prediction...